Learnable Swendsen-Wang Cuts for Image Segmentation
نویسندگان
چکیده
We propose a framework for Bayesian unsupervised image segmentation with descriptive, learnable models. Our approach is based on learning descriptive models for segmentation and applying Monte Carlo Markov chain to traverse the solution space. Swendsen-Wang cuts are adapted to make meaningful jumps in solution space.
منابع مشابه
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncut using spectral graph analysis and the minimum-cut using the maximum flow algorithm. This paper presents a third major approach by generalizing the Swendsen-Wang method– a well celebrated algorithm in statistical mech...
متن کاملOn the Relationship Between Image and Motion Segmentation
In this paper we present a generative model for image sequences, which can be applied to motion segmentation and tracking, and to image sequence compression. The model consists of regions of relatively constant color that have a motion model explaining their motion in time. At each frame, the model can allow accretion and deletion of pixels. We also present an algorithm for maximizing the poste...
متن کاملAn analysis of some models used in image segmentation
This report describes an investigation into the characteristics of a number of image models and algorithms used for the segmentation of SPOT images. The initial goals were the problems of phase transition in the model, and parameter estimation. The experimental tools used encompass a great deal of modern Markov chain Monte Carlo (MCMC) methodology, from the Gibbs sampler/Metropolis-Hastings alg...
متن کاملA comparative performance of gray level image thresholding using normalized graph cut based standard S membership function
In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...
متن کاملMRF-based Algorithms for Segmentation of SAR Images
In this paper we demonstrate a new method for Bayesian image segmentation, with specific application to Synthetic Aperture Radar (SAR) imagery, and we compare its performance to conventional Bayesian segmentation methods. Segmentation can be an important feature extraction technique in recognition problems, especially when we can incorporate prior information to improve the segmentation. Markov...
متن کامل